Activation strategy for asymmetric marking games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Activation strategy for asymmetric marking games

This paper extends the widely used activation strategy of the marking game on graphs to asymmetric marking games. The extended activation strategy is then applied to asymmetric marking games on chordal graphs, (s, t)-pseudo partial k-trees and interval graphs. Our results improve earlier upper bounds on (a, 1)gcol (Ik) and (a, 1)-gcol (Ck), where Ik and Ck denote the classes of interval and cho...

متن کامل

Efficient Strategy Computation in Zero-Sum Asymmetric Repeated Games

Zero-sum asymmetric games model decision making scenarios involving two competing players who have different information about the game being played. A particular case is that of nested information, where one (informed) player has superior information over the other (uninformed) player. This paper considers the case of nested information in repeated zerosum games and studies the computation of ...

متن کامل

On Spatial Asymmetric Games

The stability of some spatial asymmetric games is discussed. Both linear and nonlinear asymptotic stability of asymmetric hawk-dove and prisoner’s dilemma are studied. Telegraph reaction diffusion equations for the asymmetric spatial games are presented. Asymmetric game of parental investment is studied in the presence of both ordinary and cross diffusions.

متن کامل

Asymmetric Evolutionary Games

Evolutionary game theory is a powerful framework for studying evolution in populations of interacting individuals. A common assumption in evolutionary game theory is that interactions are symmetric, which means that the players are distinguished by only their strategies. In nature, however, the microscopic interactions between players are nearly always asymmetric due to environmental effects, d...

متن کامل

Asymmetric graph coloring games

We introduce the (a; b)-coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors a vertices and Bob colors b vertices. We also introduce a related game, the (a; b)-marking game. We analyze these games and determine the (a; b)chromatic numbers and (a;b)-coloring num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2008

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2007.07.004